Reset Complexity of Ideal Languages Over a Binary Alphabet
نویسندگان
چکیده
منابع مشابه
Reset Complexity of Ideal Languages
We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compare the reset complexity and the state complexity for languages related to slowly synchronizing automata and study uniqueness question for automata yielding the minimum of reset complexity.
متن کاملQuotient Complexity of Ideal Languages
We study the state complexity of regular operations in the class of ideal languages. A language L ⊆ Σ∗ is a right (left) ideal if it satisfies L = LΣ∗ (L = Σ∗L). It is a two-sided ideal if L = Σ∗LΣ∗, and an all-sided ideal if L = Σ∗ L, the shuffle of Σ∗ with L. We prefer the term “quotient complexity” instead of “state complexity”, and we use derivatives to calculate upper bounds on quotient co...
متن کاملComplexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.
متن کاملSyntactic Complexity of Ideal and Closed Languages
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity n of languages in that class. ...
متن کاملState-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length
We study the state complexity of a class of simple languages. If A is an alphabet of k letters, a k-language is a nonempty set of words of length k, that is, a uniform language of length k. By a new construction, we show that the maximal state complexity of a k-language is (k − 1)/(k − 1) + 2 + 1, and every k-language of this complexity is also a uniform language of length k of the maximal stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2019
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054119400343